Long Normal Form Proof Search and Counter-Model Generation
نویسندگان
چکیده
This paper describes an algorithm of proof search for implicational formula in intuitionistic logic. It is based on a natural deduction style formulation of long normal form of simply typed -calculus. The algorithm returns a deduction tree, which becomes a proof if the formula is provable. When the formula is unprovable, a counter-model is constructed by identifying the repeated nodes in the deduction tree. Simplicity of the model construction is due to long normal form. The completeness of the algorithm is proved.
منابع مشابه
Load Model Effect Assessment on Optimal Distributed Generation Sizing and Allocation Using Improved Harmony Search Algorithm
The operation of a distribution system in the presence of distributed generation systems has someadvantages and challenges. Optimal sizing and siting of DG systems has economic, technical, andenvironmental benefits in distribution systems. Improper selection of DG systems can reduce theseadvantages or even result in deterioration in the normal operation of the distribution system. DGallocation ...
متن کاملProof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, following S. Negri’s general method for devising sequent calculi for normal modal logics. Although it arises as a natural formalization of the Krip...
متن کاملNew Techniques in Clausal Form Generation
In automated reasoning it is common that first-order formulas need to be translated into clausal normal form for proof search. The structure of this normal form can have a large impact on the performance of first-order theorem provers, influencing whether a proof can be found and how quickly. It is common folklore that transformations should ideally minimise both the size of the generated claus...
متن کاملA An Evaluation-Driven Decision Procedure for G3i
It is well-known that G3i, the sequent calculus for intuitionistic propositional logic where weakening and contraction are absorbed into the rules, is not terminating. Indeed, due to the contraction in the rule for left implication, the naı̈ve goal-oriented proof-search strategy, consisting in applying the rules of the calculus bottom-up until possible, can generate branches of infinite length. ...
متن کاملCombining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic
We present an algorithm for deciding Gödel-Dummett logic. The originality of this algorithm comes from the combination of proofsearch in sequent calculus, which reduces a sequent to a set of pseudoatomic sequents, and counter-model construction of such pseudo-atomic sequents by a fixpoint computation. From an analysis of this construction, we deduce a new logical rule [⊃N ] which provides short...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 37 شماره
صفحات -
تاریخ انتشار 2000